Computing Borel's regulator
نویسندگان
چکیده
منابع مشابه
DYNAMIC SIMULATION OF A HIGH PRESSURE REGULATOR
In this paper, the dynamic simulation for a high pressure regulator is performed to obtain the regulator behavior. To analyze the regulator performance, the equation of motion for inner parts, the continuity equation for diverse chambers and the equation for mass flow rate were derived. Because of nonlinearity and coupling, these equations are solved using numerical methods and the results are ...
متن کاملA fast, rigorous technique for computing the regulator of a real quadratic field
We present a new algorithm for computing the regulator of a real quadratic field Q( √ D), based on an algorithm for unconditionally verifying the correctness of the regulator produced by a subexponential algorithm, that runs in expected time O(D1/6+ ) under the Generalized Riemann Hypothesis. The correctness of our algorithm relies on no unproven hypotheses and is currently the fastest known un...
متن کاملMelatonin; Growth regulator and strong antioxidant in plants
Melatonin (N-acetyl-5-methoxytryptamine) is an indole metabolite derived from tryptophan and synthesized in plant cells in the chloroplasts and mitochondria. Melatonin is present in all plant species, with large variations in its level depending on the plant organ or tissue, it is a molecule endowed with a multitude of functions that make it worthy to be referred to as a plant growth regulator....
متن کاملPothole Detection by Soft Computing
Subject- Potholes on roads are regarded as serious problems in the transportation domain and ignoring them leads to the increase of accidents, traffic, vehicle fuel consumption and waste of time and energy. As a result, pothole detection has attracted researchers’ attention and different methods have been presented for it up to now. Background- The major part of previous research is based on i...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum Mathematicum
سال: 2015
ISSN: 0933-7741,1435-5337
DOI: 10.1515/forum-2012-0064